Finite graphs have unique symmetric products
نویسندگان
چکیده
منابع مشابه
On minimal symmetric automorphism groups of finite symmetric graphs
Let r be finite connected and G a group of automorphisms of r which is transitive on vertices. Suppose that, for a vertex 0 of r, S ~ G~(O') ::; Aut S for some simple group S with S acting primitively on the set r( a) of neighbours of 0, and suppose that G is minimal with these properties. Then one of: (i) G is a nonabelian simple group, (ii) r is a Cayley graph for a normal subgroup N of G and...
متن کاملOn a class of finite symmetric graphs
Let Γ be a G-symmetric graph, and let B be a nontrivial G-invariant partition of the vertex set of Γ . This paper aims to characterize (Γ ,G) under the conditions that the quotient graph ΓB is (G, 2)-arc transitive and the induced subgraph between two adjacent blocks is 2 · K2 or K2,2. The results answer two questions about the relationship between Γ and ΓB for this class of graphs. c © 2007 El...
متن کاملHighly connected rigidity matroids have unique underlying graphs
In this note we consider the following problem: is there a (smallest) integer kd such that every graph G is uniquely determined by its d-dimensional rigidity matroid Rd(G), provided that Rd(G) is kd-connected? Since R1(G) is isomorphic to the cycle matroid of G, a celebrated result of H. Whitney implies that k1 = 3. We prove that if G is 7-vertex-connected then it is uniquely determined by R2(G...
متن کاملEffective scalar products of D-finite symmetric functions
Many combinatorial generating functions can be expressed as combinations of symmetric functions, or extracted as sub-series and specializations from such combinations. Gessel has outlined a large class of symmetric functions for which the resulting generating functions are D-finite. We extend Gessel’s work by providing algorithms that compute differential equations these generating functions sa...
متن کاملClassifying pentavalnet symmetric graphs of order $24p$
A graph is said to be symmetric if its automorphism group is transitive on its arcs. A complete classification is given of pentavalent symmetric graphs of order 24p for each prime p. It is shown that a connected pentavalent symmetric graph of order 24p exists if and only if p=2, 3, 5, 11 or 17, and up to isomorphism, there are only eleven such graphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Topology and its Applications
سال: 2006
ISSN: 0166-8641
DOI: 10.1016/j.topol.2005.04.006